Vectorization of the Radix r Self-Sorting FFT
نویسندگان
چکیده
In this work we present a study of the vectorization of the fast Fourier transform. The algorithm we have considered is the radix r self-sorting algorithm which does not require additional data reordering stages (digit-reversal) as this process is inherently carried out during the execution of the algorithm. For obtainig the vectorized version of the algorithm we employ a formulation of the FFT in terms of an operator string. Each of the operators represents an operation over the data ow of the algorithm and will have a direct implementation on the vecto-rial processor. The algorithm thus obtained has been implemented on the Fujitsu VP-2400/10 vector computer, resulting in reduced execution times.
منابع مشابه
Vectorization Techniques for BlueGene/L’s Double FPU
This paper presents vectorization techniques tailored to meet the specifics of the twoway single-instruction multiple-data (SIMD) double-precision floating-point unit, which is a core element of the node ASICs of IBM's 360 Tflop/s supercomputer BlueGene/L. The paper focuses on the general-purpose basic-block vectorization methods provided by the Vienna MAP vectorizer. In addition, the paper int...
متن کاملThe Effect of Local Sort on Parallel Sorting Algorithms
We show the importance of sequential sorting in the context of in memory parallel sorting of large data sets of 64 bit keys. First, we analyze several sequential strategies like Straight Insertion, Quick sort, Radix sort and CC-Radix sort. As a consequence of the analysis, we propose a new algorithm that we call Sequential Counting Split Radix sort, SCS-Radix sort. SCS-Radix sort is a combinati...
متن کاملA Generalized Prime Factor FFT Algorithm for any N = 2p 3q 5r
Prime factor fast Fourier transform (FFT) algorithms have two important advantages: they can be simultaneously self-sorting and in-place, and they have a lower operation count than conventional FFT algorithms. The major disadvantage of the prime factor FFT has been that it was only applicable to a limited set of values of the transform length N. This paper presents a generalized prime factor FF...
متن کاملSplit Radix Algorithm for 2^R*3^M DFT
Discrete Fourier transform (DFT) is one of the most important tools used in almost all fields of science and engineering. DFT can be implemented with efficient algorithms generally classified as fast Fourier transforms (FFT). The most widely used approaches are so-called the algorithms for, such as radix-2, radix 4 and split radix FFT (SRFFT). Considerable researches have carried out and result...
متن کاملA Novel Architecture for Radix - 4 Pipelined FFT Processor using Vedic Mathematics Algorithm
The FFT processor is a critical block in all multi-carrier systems used primarily in the mobile environment. The portability requirement of these systems is mainly responsible for the need of low power FFT architectures. In this study, an efficient addressing scheme for radix-4 64 point FFT processor is presented. It avoids the modulo-r addition in the address generation; hence, the critical pa...
متن کامل